Hypothesis Model Verification of Value-sharing Structures through Sensory Expressions
نویسندگان
چکیده
منابع مشابه
investigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Hypothesis and Verification in 3D Model Matching
This paper addresses 3-D hypothesis and mixed 3-D and 2-D verification as a means of obtaining high performance closed loop model-matching. Performance includes the following criteria: low computational expence; low failure rate; and good localisation. Hypotheses are based upon congruencies identified between 3-D scene and model descriptions. Verification is provided by quantitative evaluation ...
متن کاملA Power Model for Register-Sharing Structures
Register files (RF) are known to consume about 20% of the power inside a processor. Embedded systems, due to area and timing constraints, generally have small register files, which can cause significant register pressure. This work explores how having a map-table or a map-vector can decrease the power dissipation in the processor. The distribution of register writes and sharing of commonly occu...
متن کاملEvolutionary minimum verification error learning of the alternative hypothesis model for LLR-based speaker verification
It is usually difficult to characterize the alternative hypothesis precisely in a log-likelihood ratio (LLR)-based speaker verification system. In a previous work, we proposed using a weighted arithmetic combination (WAC) or a weighted geometric combination (WGC) of the likelihoods of the background models instead of heuristic combinations, such as the arithmetic mean and the geometric mean, to...
متن کاملMechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning about sharing and aliasing in pointer-based data structures. Both of these are difficulties for reasoning in separation logic because they rely, fundamentally, on non-separate heaps. We show how sharing can be achieve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of Japan Society of Kansei Engineering
سال: 2020
ISSN: 1884-5258
DOI: 10.5057/jjske.tjske-d-19-00073